package hotLeetcode;

import java.util.Arrays;

public class H62Leetcode {


    public int uniquePaths1(int m, int n) {
        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }

        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];

            }
        }
        return dp[m-1][n-2];

    }


    public static int uniquePaths(int m, int n) {

        int[] dp = new int[n];
        Arrays.fill(dp, 1);


        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[j] += dp[j-1];
            }

        }
        return dp[n - 1];
    }





    public static void main(String[] args) {
        uniquePaths(3, 7);

    }

}
